Model Checking of Safety Properties for Complex Systems Using MWF Inactivation and MNWF Activation

نویسندگان

  • Atsushi Katoh
  • Shinichiro Haruyama
  • Naohiko Kohtake
  • Yoshiaki Ohkami
چکیده

One of the aims of model checking is to confirm a system’s safety properties. Safety properties state that undesirable events never occur. This paper describes a method that derives comprehensive and rigorous safety properties for model checking. In general, an undesirable event in a system is abstract, and so safety properties corresponding to undesirable events cannot be directly applied to model checking. To be applicable to model checking, safety properties must be derived by interpreting undesirable events in a system using the system specifications. In the model checking of complex systems, some safety properties may be neglected or insufficiently specified because the functions and/or conditions in the systems are complex. The proposed method adopts the concepts of “Must Work Function (MWF) Inactivation” and “Must Not Work Function (MNWF) Activation” to solve these issues. Comprehensive and rigorous safety properties for model checking are derived according to these concepts. Undesirable events are embodied by rewriting knowledge according to the term rewriting system. The effectiveness of the proposed method is evaluated by applying it to a wireless rail crossing system. The results show that the derived safety properties offer a significantly improved degree of comprehensiveness and rigor. Keywords— Model Checking; Safety Property; Must Work Function (MWF); Must Not Work Function (MNWF); Term Rewriting System Full Text: http://www.ijcsmc.com/docs/papers/December2013/V2I12201307.pdf

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reachability checking in complex and concurrent software systems using intelligent search methods

Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...

متن کامل

A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness

Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...

متن کامل

Checking the Sensitivity of Solute Advection- Dispersion Model to Reaction Coefficients and River Hydraulic Properties in the Process of Dissolved Oxygen Simulation

Nowadays, environmental pollutions especially water pollution is increasingly developing. One of the problems of entering the pollutants to rivers is reduction in the concentration of river dissolved oxygen. In order to manage the water resources, amount of dissolved oxygen should be predicted. This study presents a novel equation for simulating the concentration of river dissolved oxygen by ad...

متن کامل

Model Checking Hierarchical Probabilistic Systems

Probabilistic modeling is important for random distributed algorithms, bio-systems or decision processes. Probabilistic model checking is a systematic way of analyzing finite-state probabilistic models. Existing probabilistic model checkers have been designed for simple systems without hierarchy. In this paper, we extend the PAT toolkit to support probabilistic model checking of hierarchical co...

متن کامل

Model Checking Safety Properties in Modular High-Level Nets

Model checking by exhaustive state space enumeration is one of the most developed analysis methods for distributed event systems. Its main problem—the size of the state spaces—has been addressed by various reduction methods. Complex systems tend to consist of loosely connected modules, which may perform internal tasks in parallel. The possible interleavings of these parallel tasks easily leads ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013